On xD-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks

This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal ordering problem in the Weyl algebra W = 〈x,D|Dx − xD = 1〉. Any word ω ∈ W with m x’s and n D’s can be expressed in the normally ordered form ω = xm−n ∑ k>0 { ω k } xkDk, where { ω k } is known as the Stirling number of the second kind for the word ω. This study considers the expansions of restricted words ω in W over the sequences {(xD)}k>0 and {xDx}k>0. Interestingly, the coefficients in individual expansions turn out to be generalizations of the Stirling numbers of the first kind and the Lah numbers. The coefficients will be determined through enumerations of some combinatorial structures linked to the words ω, involving decreasing forest decompositions of quasithreshold graphs and non-attacking rook placements on Ferrers boards. Extended to q-analogues, weighted refinements of the combinatorial interpretations are also investigated for words in the q-deformed Weyl algebra.